A Classification of the Probabilistic Polynomial Time Hierarchy Under Fault Tolerant Access to Oracle Classes
نویسنده
چکیده
We show a simple application of Zuckerman's ampliication technique to the classiication problem of the probabilistic polynomial time hierarchy formed by interleaving all possible oracle classes from BPP, RP, coRP and ZPP, in any nite number of levels. In the fault tolerant model introduced by Cai, Hemachandra and Vysko c, we arrive at a complete classiication.
منابع مشابه
Separating Complexity Classes Using Autoreducibility
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that ...
متن کاملOn the probabilistic closure of the loose unambiguous hierarchy
Unambiguous hierarchies [NR93, LR94, NR98] are defined similarly to the polynomial hierarchy; however, all witnesses must be unique. These hierarchies have subtle differences in the mode of using oracles. We consider a “loose” unambiguous hierarchy prUH• with relaxed definition of oracle access to promise problems. Namely, we allow to make queries that miss the promise set; however, the oracle ...
متن کاملOperators of higher order
Motivated by results on interactive proof systems we investigate the computational power of quantifiers applied to well-known complexity classes. In special, we are interested in existential, universal and probabilistic bounded error quantifiers ranging over words and sets of words, i.e. oracles if we think in a Turing machine model. In addition to the standard oracle access mechanism, we also ...
متن کاملOn Randomized versus Deterministic Computation ? Zpp a = Exptime a = Exptime (= Dtime(2 Poly )). Furthermore, for All the Sets M : M Ur a () M 2 Exptime
In contrast to deterministic or nondeterministic computation, it is a fundamental open problem in randomized computation how to separate diierent ran-domized time classes (at this point we do not even know how to separate linear randomized time from O(n log n) randomized time) or how to compare them relative to corresponding deterministic time classes. In other words we are far from understandi...
متن کاملOn the Bpp Hierarchy Problem
In this paper we give arguments both for and against the existence of an oracle A, relative to which BPP equals probabilistic linear time. First, we prove a structure theorem for probabilistic oracle machines, which says that either we can x the output of the machine by setting the answer to only polynomially many oracle strings, or else we can set part of the oracle such that the machine becom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 69 شماره
صفحات -
تاریخ انتشار 1999